Deǐneko and Woeginger (Oper. Res. Lett. 28 (2001) 169) present a proof that a result of Du and Hwang (Math. Oper. Res. 11 (1986) 187) about the optimum arrangement of the items in a consecutive-2-out-of-n cycle system is a simple special case of Supnick's result about the optimum solution of the travelling salesman problem with certain specially structured distance matrices. In this paper, it is pointed out that Deǐneko and Woeginger's proof contains a flaw that makes its conclusion invalid.Peer Reviewe
We present a new viewpoint on how some combinatorial optimization problems are solved. When applying...
The method of alternating projections involves projecting an element of a Hilbert space cyclically o...
We extend Jackson and Watts’s (2002) result on the coincidence of S-stochastically stable and core s...
Deǐneko and Woeginger (Oper. Res. Lett. 28 (2001) 169) present a proof that a result of Du and Hwang...
In 1986, Du and Hwang proved that the probability of failure in a cyclic double-loop system is alway...
Rosenkrantz et al. (SIAM J. Comput. 6 (1977) 563) and Johnson and Papadimitriou (in: E.L. Lawler, J....
Abstract. A cyclic consecutive-k-out-of-n: G system consists of n components lying on a cycle. Those...
There are n travellers who have k bicycles and they wish to complete a journey in the shortest possi...
The traveling-salesman problem is one of the most studied combinatorial optimization problems, becau...
We present a complete proof for the invariant optimal assignment for consecutive-k-out-of-n: G Cycl...
The Bottleneck Traveling Salesman Problem (BTSP) is the problem of finding a Hamiltonian tour in a c...
We initiate the study of the cycle structure of uniformly random parking functions. Using the combin...
When the matrix of distances between cities is symmetric and circulant, the traveling salesman probl...
Abstract. We present a complete proof for the invariant optimal assignment for consecutive-k-out-of-...
Following the recent proposal made by Bouttier et al [Phys. Rev. E 76, 041140 (2007)], we study anal...
We present a new viewpoint on how some combinatorial optimization problems are solved. When applying...
The method of alternating projections involves projecting an element of a Hilbert space cyclically o...
We extend Jackson and Watts’s (2002) result on the coincidence of S-stochastically stable and core s...
Deǐneko and Woeginger (Oper. Res. Lett. 28 (2001) 169) present a proof that a result of Du and Hwang...
In 1986, Du and Hwang proved that the probability of failure in a cyclic double-loop system is alway...
Rosenkrantz et al. (SIAM J. Comput. 6 (1977) 563) and Johnson and Papadimitriou (in: E.L. Lawler, J....
Abstract. A cyclic consecutive-k-out-of-n: G system consists of n components lying on a cycle. Those...
There are n travellers who have k bicycles and they wish to complete a journey in the shortest possi...
The traveling-salesman problem is one of the most studied combinatorial optimization problems, becau...
We present a complete proof for the invariant optimal assignment for consecutive-k-out-of-n: G Cycl...
The Bottleneck Traveling Salesman Problem (BTSP) is the problem of finding a Hamiltonian tour in a c...
We initiate the study of the cycle structure of uniformly random parking functions. Using the combin...
When the matrix of distances between cities is symmetric and circulant, the traveling salesman probl...
Abstract. We present a complete proof for the invariant optimal assignment for consecutive-k-out-of-...
Following the recent proposal made by Bouttier et al [Phys. Rev. E 76, 041140 (2007)], we study anal...
We present a new viewpoint on how some combinatorial optimization problems are solved. When applying...
The method of alternating projections involves projecting an element of a Hilbert space cyclically o...
We extend Jackson and Watts’s (2002) result on the coincidence of S-stochastically stable and core s...